Testing Language Containment for ω-Automata Using BDDs
نویسندگان
چکیده
منابع مشابه
Language Containment Checking with Nondeterministic BDDs
Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for language containment checking between two Büchi automata. Our algorithm avoids determinization by intersecting the implementation automaton with the complement of the specification automaton as an alternating automaton. We prese...
متن کاملEfficient Verification of Timed Automata using BDDs
This paper investigates the efficient reachability analysis of timed automata. It describes a discretization of time which preserves the reachability properties. The discretization allows to represent sets of configurations of timed automata as binary decision diagrams (BDDs). Further techniques, like computing good variable orderings, are applied to use the full potential of BDDs as compact an...
متن کاملEfficient inclusion testing for simple classes of unambiguous ω-automata
We show that language inclusion for languages of infinite words defined by nondeterministic automata can be tested in polynomial time if the automata are unambiguous and have simple acceptance conditions, namely safety or reachability conditions. An automaton with safety condition accepts an infinite word if there is a run that never visits a forbidden state, and an automaton with reachability ...
متن کاملEdge-streett/edge-rabin Automata Environment for Formal Veriication Using Language Containment
We present the edge-Streett/edge-Rabin environment for doing veriication using language containment. This environment has a number of desirable properties compared with the L-process/L-automaton environment ((Kur87b]), which is a practical language-containment-based formal veriication environment: It contains the L-environment as a subset. It can be exponentially more compact than the L-environ...
متن کاملTypeness for ω-Regular Automata
We introduce and study three notions of typeness for automata on infinite words. For an acceptance-condition class γ (that is, γ is weak, Büchi, co-Büchi, Rabin, or Streett), deterministic γ-typeness asks for the existence of an equivalent γ-automaton on the same deterministic structure, nondeterministic γ-typeness asks for the existence of an equivalent γ-automaton on the same structure, and γ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1995
ISSN: 0890-5401
DOI: 10.1006/inco.1995.1055